Intrusion-aware Alert Validation Algorithm for Cooperative Distributed Intrusion Detection Schemes of Wireless Sensor Networks

Existing anomaly and intrusion detection schemes of wireless sensor networks have mainly focused on the detection of intrusions. Once the intrusion is detected, an alerts or claims will be generated. However, any unidentified malicious nodes in the network could send faulty anomaly and intrusion claims about the legitimate nodes to the other nodes. Verifying the validity of such claims is a critical and challenging issue that is not considered in the existing cooperative-based distributed anomaly and intrusion detection schemes of wireless sensor networks. In this paper, we propose a validation algorithm that addresses this problem. This algorithm utilizes the concept of intrusion-aware reliability that helps to provide adequate reliability at a modest communication cost. In this paper, we also provide a security resiliency analysis of the proposed intrusion-aware alert validation algorithm.Comment: 19 pages, 7 figure

A Preliminary Feasibility Study of the LARPBS Optical Bus Parallel Model

This paper assesses the realistic and practical nature of the LARPBS optical bus parallel model with respect to recent available optical technologies. An optical power and signal loss analysis for the LARPBS model is conducted. A straight forward implementation of the bus model without amplification of optical signals suggests high losses that limit the number of processors to between eight and twelve. Nevertheless, this work also suggests that variations in the architecture may lead to more practical parallel system

Mobility Tracking for Mobile Ad Hoc Networks

Abstract. In mobile ad hoc networks (MANETs), nodes mobility cause network topologies to change dynamically over time, which complicates important tasks such as broadcasting and routing. Mobility tracking is the task to determine a trajectory of the mobile node in time which can facilitate the forwarding decision in network protocols ’ design. In this paper, we investigate the regularity of mobility patterns and propose comprehensive mobility predication models, that is, not only piecewise linear but also nonlinear models which are based on nodes ’ historical location/speed information. As for historical information, we consider not only periodical update but also conditional update networks. Simulation results validate the accuracy of our proposed tracking schemes. We also compare the performance of those schemes and observe their relationship with parameters of update protocols.

Achieving Network Level Privacy in Wireless Sensor Networks

Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks